Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
نویسندگان
چکیده
منابع مشابه
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel composition introduces resolvable nondeterminism, i.e., nondeterminism that will be resolved in later design phases or by the operating system. Sometimes it is also important to express inherent nondeterminism for equa...
متن کاملProcess Algebra Having Inherent Choice : Revised Semantics for Concurrent Systems 1
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel composition introduces resolvable nondeterminism, i.e., nondeterminism that will be resolved in later design phases or by the operating system. Sometimes it is also important to express inherent nondeterminism for equa...
متن کاملProcess Algebra Semantics for Queues
An unbounded queue over a finite set of data 1is,,a Q. in -.A defined by an infinite system of guarded equations. The aim of this paper is to show that no finite system of guarded equations is capable of defining Q. This is a revised version of: Process algebra semantics for queues, Mathematical Centre Research Report IW241,, Amst,rdam.,1983.. * present affiliation & correspondence address: of ...
متن کامل-angelic Choice for Process Algebra
The-angelic choice is an operator that captures the behaviour of the external choice of CSP in a branching time setting. The idea of the-angelic choice is to delay any choice until an observable action happens. In this way, this new operator avoids preemption introduced by internal actions (actions). It is studied in theories with abstraction, more precisely, branching bisimulation and-bisimula...
متن کاملInterpreted Systems Semantics for Process Algebra with Identity Annotations
Process algebras have been developed as formalisms for specifying the behavioral aspects of protocols. Interpreted systems have been proposed as a semantic model for multi-agent communication. In this paper, we connect these two formalisms by defining an interpreted systems semantics for a generic process algebraic formalism. This allows us to translate and compare the vast body of knowledge an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.08.016